Minimizing the Total Completion Time and Total Earliness Time Functions for a Machine Scheduling Problem Using Local Search Methods

Two agents single machine scheduling problem with total completion time and total weighted completion time objectives

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

1Laboratory of Algorithms and Technologies for Networks Analysis National Research University Higher School of Economics 136 Rodionova street, Niznhy Novgorod 603093, Russia 2Department of Industrial and Systems Engineering, University of Florida 303 Weil Hall, Gainesville, FL, 32611, USA 3Department of Operations Management & Operations Research, University of Groningen Nettelbosje 2, 9747 AE ...

Public transport fleet scheduling for minimizing total transfer waiting time

Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables....

Minimizing the Total Completion Time in a Two-Machine Group Scheduling Problem with Carryover Sequence Dependency

The two-machine group-scheduling problem for minimizing the total completion time with carryover sequence dependency is addressed in this paper. These problems are typically encountered in electronics manufacturing. A procedure called Minsetup is developed to determine the lower bound for the total completion time, and a search algorithm based on tabu search is proposed to solve the problem. Un...

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...